Spectral optimization problems with internal constraint
نویسندگان
چکیده
منابع مشابه
Spectral Optimization Problems with Internal Constraint
We consider spectral optimization problems with internal inclusion constraints, of the form min { λk(Ω) : D ⊂ Ω ⊂ R, |Ω| = m } , where the set D is fixed, possibly unbounded, and λk is the k th eigenvalue of the Dirichlet Laplacian on Ω. We analyze the existence of a solution and its qualitative properties, and rise some open questions.
متن کاملResilient Distributed Constraint Optimization Problems
Dynamic distributed constraint optimization problems (Dynamic DCOPs) are useful in modeling various distributed combinatorial optimization problems that are dynamically changing over time. Previous attempts assume that it is possible for agents to take on a new solution each time the problem changes. However, in some applications, it is necessary to commit to a single solution at the start of t...
متن کاملPartially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many real-life applications, more functions should be optimized at the same time, and solutions are ranked by means of a Partial Order. Also, when dealing with Null values, the solution set is ranked through a Partial Order, ...
متن کاملAsymmetric Distributed Constraint Optimization Problems
Distributed Constraint Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. Many multi-agent problems include constraints that produce different gains (or costs) for the participating agents. Asymmetric gains of constrained agents cannot be naturally represented by the stand...
متن کاملOptimum Anytime Bounding for Constraint Optimization Problems
In this paper, we consider Constraint Optimization Problems in a Resource-Bounded context. We observe that both exact and approximate methods produce only an anytime upper bound of the optimum (in case of minimization). No lower bound, and thus no quality is available at run time. For a meta-reasoning system, it is difficult to reason on the basis of a so poor piece of information. Therefore, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire
سال: 2013
ISSN: 0294-1449
DOI: 10.1016/j.anihpc.2012.10.002